The Complexity of Plate Probabilistic Models
نویسندگان
چکیده
Plate-based probabilistic models combine a few relational constructs with Bayesian networks, so as to allow one to specify large and repetitive probabilistic networks in a compact and intuitive manner. In this paper we investigate the combined, data and domain complexity of plate models, showing that they range from polynomial to #P-complete to #EXP-complete.
منابع مشابه
Probabilistic Evaluation on the Free Vibration of Functionally Graded Material Plates Using 3D Solution and Meta-Model Methods
This paper presents a probabilistic assessment on the free vibration analysis of functionally graded material plates, including layers with magneto-electro-elastic properties, using the 3D solution and surrogate models. The plate is located on an elastic foundation and the intra-layer slipping effect is also considered in the analysis by employing the generalized intra-layer spring model. Due t...
متن کاملSafety Analysis of the Patch Load Resistance of Plate Girders: Influence of Model Error and Variability
This study aims to undertake a statistical study to evaluate the accuracy of nine models that have been previously proposed for estimating the ultimate resistance of plate girders subjected to patch loading. For each model, mean errors and standard errors, as well as the probability of underestimating or overestimating patch load resistance, are estimated and the resultant values are compared o...
متن کاملارائه یک مدل احتمالاتی برای توزیع خوردگی یکنواخت در سکوهای ثابت فلزی در خلیج فارس
For structural reliability assessment or risk analysis of aging offshore steel structures, it is essential to have a probabilistic model, which contains specific statistical parameters, and predicts long term corrosion loss as a function of time. The aim of this study is to propose such model for offshore jacket platforms in the Persian Gulf. Field measurements for material loss due to uniform ...
متن کاملExtension of Cube Attack with Probabilistic Equations and its Application on Cryptanalysis of KATAN Cipher
Cube Attack is a successful case of Algebraic Attack. Cube Attack consists of two phases, linear equation extraction and solving the extracted equation system. Due to the high complexity of equation extraction phase in finding linear equations, we can extract nonlinear ones that could be approximated to linear equations with high probability. The probabilistic equations could be considered as l...
متن کاملThe Complexity of Bayesian Networks Specified by Propositional and Relational Languages
We examine the complexity of inference in Bayesian networks specified by logical languages. We consider representations that range from fragments of propositional logic to function-free first-order logic with equality; in doing so we cover a variety of plate models and of probabilistic relational models. We study the complexity of inferences when network, query and domain are the input (the inf...
متن کامل